气液两相管流流型识别理论研究进展

综述了气液两相流流型识别理论及方法的研究进展。首先探讨了流型划分问题，然后针对水平管路、垂直管路及摇摆管路介绍了两相流流型转换机理及转换的边界条件；对于流型的在线识别，介绍了基于波动理论、神经网络和图像处理的流型识别方法。最后提出了气液两相管流流型识别中亟待开展的理论研究方向。     

攻角对双三角翼旋涡特性影响的数值模拟

采用数值方法研究了双三角翼上涡流运动随攻角的变化规律.计算取层流假设,研究了攻角在5°～30°,76°/40°后掠双三角翼绕流的流场结构随攻角的变化,并对双三角翼上涡破裂现象对流场结构及气动力性能的影响进行了分析.结果表明,双三角翼上的多涡结构存在强烈的相互影响,较大的攻角会导致涡破裂在翼面上发生,严重影响了双三角翼的气动力性能.     

带控制舵机动弹头粘性绕流数值模拟

采用空间二阶精度的交替方向隐式分解的NND格式求解完全气体假定下的非定常薄层近似Navier Stokes方程 ,并采用抛物化的椭圆型方程生成复杂带翼外形的空间网格。最后给出带控制舵机动弹头在M∞ =7 3,α =2 0°下所计算的流场等值线、表面压强分布及表面极限流线     

学术期刊的“三审制”与多元化审稿探析

“三审制”传统的机制以及运作的惯例，已经无法适应时代发展的要求。在原先严肃但又有点呆板的审稿机制中，需要注入多元化的审稿方式。编者和审者在坚持“三审制”严肃性一面的同时，应多注意运作方式等的灵活性。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

管道瞬态激振响应管长的计算

在水击压力波沿管道传播的过程中，遇到内部流场边界时，就会对管道产生激振响应，从而引起管道的振动。针对管道的激振响应，分别从水击波的简化模型和考虑管道和流体相互作用的固液耦合模型，推导了管道瞬态激振响应中的激振部件间隔管长计算公式，分析比较了简化模型和耦合模型的不同，并且提出一些防止共振的方法。     

基于重力加速度的自对准算法在摇摆台上的验证

摇摆基座条件下陀螺和加速度计测量的地球自转角速度和重力加速度受到了摇摆运动的干扰,无法根据陀螺和加速度计的输出直接获得初始姿态矩阵。针对这一问题,通过验证实验证明了基于重力加速度的对准算法的有效性,并依据实验结果从理论上对该方法的对准误差进行了分析,提出了进一步提高对准精度的措施。     

Hilbert空间中次连续拟非扩张映像不动点的迭代方法

首次引用一种迭代算法，用来构造Hilbert空间中次连续拟非扩张映像的不动点；使用新的算法证明了一个强收敛定理，其优点是不要求映像具有次闭性质。     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

A computation procedure for the exact solution of location-allocation problems with rectangular distances

A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem.